Measuring Point Set Similarity with the Hausdor Distance: Theory and Applications
نویسنده
چکیده
We consider the problem of measuring the similarity between two nite point sets using the Hausdor distance H(A;B). This distance is small when each point in A is close to some point in B, and each point in B is close to some point in A. The de nition does not require that A and B have the same number of points. More importantly, H(A;B) is a metric. A point set is identical only to itself, the order of comparison is irrelevant, and the triangle inequality holds. If two point sets are similar to a third, then they are similar to each other. This agrees with our intuition of shape similarity. The Hausdor distance is insensitive to small perturbations of the point sets. This stability is important because it allows for small positional errors in point feature sets. Also, the Hausdor distance does not build one-to-one correspondences between the points in the two sets. Shape matchers which do so will require an unreasonable amount of time when the number of features detected becomes very large. For cases in which we do not want symmetry, there is a directed version of the Hausdor distance, denoted h(A;B). This distance from A to B is small whenever each point of A is close to some point in B. Consider, for example, an illustration retrieval system which compares point feature sets of a database illustration and a given query. We may decide that a query is similar to a database gure if features present in the query are also present in the database gure, but not necessarily vice versa. In this case we would use the directed Hausdor distance from the query set to the database gure set. This paper is intended to be a summary and synthesis of four papers:
منابع مشابه
Measuring the Similarity of Trajectories Using Fuzzy Theory
In recent years, with the advancement of positioning systems, access to a large amount of movement data is provided. Among the methods of discovering knowledge from this type of data is to measure the similarity of trajectories resulting from the movement of objects. Similarity measurement has also been used in other data mining methods such as classification and clustering and is currently, an...
متن کاملNew distance and similarity measures for hesitant fuzzy soft sets
The hesitant fuzzy soft set (HFSS), as a combination of hesitant fuzzy and soft sets, is regarded as a useful tool for dealing with the uncertainty and ambiguity of real-world problems. In HFSSs, each element is defined in terms of several parameters with arbitrary membership degrees. In addition, distance and similarity measures are considered as the important tools in different areas such as ...
متن کاملA Modi ed Hausdor Distance for Object Matching
The purpose of object matching is to decide the similarity between two objects. This paper introduces 24 possible distance measures based on the Hausdor distance between two point sets. These measures can be used to match two sets of edge points extracted from any two objects. Based on our experiments on synthetic images containing various levels of noise, we determined that one of these distan...
متن کاملExact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations
We consider the following geometric pattern matching problem: Given two sets of points in the plane, P andQ, and some > 0, nd a similarity transformation (translation, rotation and scale) such that h(T (P ); Q) < , where h(:; :) is the directional Hausdor distance with L1 as the underlying metric. Similarity transformations have not been dealt with in the context of the directional Hausdor dist...
متن کامل